Finding Double Euler Trails of Planar Graphs in Linear Time
نویسندگان
چکیده
This paper answers an open question in the design of complimentary metal-oxide semiconductor VLSI circuits. The question asks whether a polynomial-time algorithm can decide if a given planar graph has a plane embedding E such that E has an Euler trail P = e1e2 . . . em and its dual graph has an Euler trail P ∗ = e1e ∗ 2 . . . e ∗ m, where e ∗ i is the dual edge of ei for i = 1, 2, . . . ,m. This paper answers this question in the affirmative by presenting a linear-time algorithm.
منابع مشابه
Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus
Anton Kotzig has shown that every connected 4-regular plane graph has an A-trail, that is an Euler trail in which any two consecutive edges lie on a common face boundary. We shall characterise the 4-regular plane graphs which contain two orthogonal A-trails, that is to say two A-trails for which no subtrail of length 2 appears in both A-trails. Our proof gives rise to a polynomial algorithm for...
متن کاملGraph Isomorphism for Bounded Genus Graphs In Linear Time
For every integer g, isomorphism of graphs of Euler genus at most g can be decided in linear time. This improves previously known algorithms whose time complexity is nO(g) (shown in early 1980’s), and in fact, this is the first fixed-parameter tractable algorithm for the graph isomorphism problem for bounded genus graphs in terms of the Euler genus g. Our result also generalizes the seminal res...
متن کاملLinear-time algorithms to color topological graphs
We describe a linear-time algorithm for 4-coloring planar graphs. We indeed give an O(V + E + |χ| + 1)-time algorithm to C-color V -vertex E-edge graphs embeddable on a 2-manifold M of Euler characteristic χ where C(M) is given by Heawood’s (minimax optimal) formula. Also we show how, in O(V + E) time, to find the exact chromatic number of a maximal planar graph (one with E = 3V − 6) and a colo...
متن کاملOn finding two-connected subgraphs in planar graphs
We consider a basic problem in the design of reliable networks, namely, that of nding a minimum-weight 2-connected subgraph spanning a given set K of vertices in a planar graph. We show a relationship between this problem and that of nding shortest trails and cycles enclosing K , and derive a polynomial-time algorithm in the case when the vertices of K all lie on the same face.
متن کاملThe Recognition of Double Euler Trails in Series-Parallel Networks
Ž . X Given a series-parallel network network, for short N, its dual network N is given by interchanging the series connection and the parallel connection of network N. We usually use a series-parallel graph to represent a network. Let w x w X x X G N and G N be graph representations of N and N , respectively. A sequence Ž w x w X x. of edges e , e , . . . , e is said to form a common trail on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999